Processing a request for encoded data in a storage network

ABSTRACT

A method for execution by a dispersed storage and task (DST) execution unit includes receiving a slice access request for execution by the DST execution unit. At least one ordered codec algorithm is identified. The slice access request is executed by utilizing the at least one ordered codec algorithm. A slice access response indicating an outcome of the slice access request is generated by the DST execution unit.

CROSS REFERENCE TO RELATED APPLICATIONS

The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No. 15/143,988, entitled “Accessing An Encoded Data Slice In A Dispersed Storage Network”, filed May 2, 2016, which claims priority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application No. 62/199,816, entitled “Storing Data And Associated Metadata In A Dispersed Storage Network”, filed Jul. 31, 2015, both of which are hereby incorporated herein by reference in their entirety and made part of the present U.S. Utility Patent Application for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

Aspects of this invention relate generally to computer networks and more particularly to dispersed storage of data and distributed task processing of data.

Description of Related Art

Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.

In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a distributed computing system in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention;

FIG. 3 is schematic block diagram of an embodiment of a dispersed storage network (DSN) in accordance with the present invention; and

FIG. 4 is a flowchart illustrating an example of accessing an encoded data slice in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a distributed computing system 10 that includes a user device 12 and/or a user device 14, a distributed storage and/or task (DST) processing unit 16, a distributed storage and/or task network (DSTN) managing unit 18, a DST integrity processing unit 20, and a distributed storage and/or task network (DSTN) module 22. The components of the distributed computing system 10 are coupled via a network 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN). Hereafter, the distributed computing system 10 may be interchangeably referred to as a dispersed storage network (DSN).

The DSTN module 22 includes a plurality of distributed storage and/or task (DST) execution units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.). Each of the DST execution units is operable to store dispersed error encoded data and/or to execute, in a distributed manner, one or more tasks on data. The tasks may be a simple function (e.g., a mathematical function, a logic function, an identify function, a find function, a search engine function, a replace function, etc.), a complex function (e.g., compression, human and/or computer language translation, text-to-voice conversion, voice-to-text conversion, etc.), multiple simple and/or complex functions, one or more algorithms, one or more applications, etc. Hereafter, the DST execution unit may be interchangeably referred to as a storage unit and a set of DST execution units may be interchangeably referred to as a set of storage units.

Each of the user devices 12-14, the DST processing unit 16, the DSTN managing unit 18, and the DST integrity processing unit 20 include a computing core 26 and may be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a personal computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. User device 12 and DST processing unit 16 are configured to include a DST client module 34.

With respect to interfaces, each interface 30, 32, and 33 includes software and/or hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between user device 14 and the DST processing unit 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between user device 12 and the DSTN module 22 and between the DST processing unit 16 and the DSTN module 22. As yet another example, interface 33 supports a communication link for each of the DSTN managing unit 18 and DST integrity processing unit 20 to the network 24.

The distributed computing system 10 is operable to support dispersed storage (DS) error encoded data storage and retrieval, to support distributed task processing on received data, and/or to support distributed task processing on stored data. In general and with respect to DS error encoded data storage and retrieval, the distributed computing system 10 supports three primary operations: storage management, data storage and retrieval, and data storage integrity verification. In accordance with these three primary functions, data can be encoded (e.g., utilizing an information dispersal algorithm (IDA), utilizing a dispersed storage error encoding process), distributedly stored in physically different locations, and subsequently retrieved in a reliable and secure manner. Hereafter, distributedly stored may be interchangeably referred to as dispersed stored. Such a system is tolerant of a significant number of failures (e.g., up to a failure level, which may be greater than or equal to a pillar width (e.g., an IDA width of the IDA) minus a decode threshold minus one) that may result from individual storage device (e.g., DST execution unit 36) failures and/or network equipment failures without loss of data and without the need for a redundant or backup copy. Further, the distributed computing system 10 allows the data to be stored for an indefinite period of time without data loss and does so in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).

The second primary function (i.e., distributed data storage and retrieval) begins and ends with a user device 12-14. For instance, if a second type of user device 14 has data 40 to store in the DSTN module 22, it sends the data 40 to the DST processing unit 16 via its interface 30. The interface 30 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). In addition, the interface 30 may attach a user identification code (ID) to the data 40.

To support storage management, the DSTN managing unit 18 performs DS management services. One such DS management service includes the DSTN managing unit 18 establishing distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for a user device 12-14 individually or as part of a group of user devices. For example, the DSTN managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within memory of the DSTN module 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The DSTN managing unit 18 may facilitate storage of DS error encoding parameters for each vault of a plurality of vaults by updating registry information for the distributed computing system 10. The facilitating includes storing updated system registry information in one or more of the DSTN module 22, the user device 12, the DST processing unit 16, and the DST integrity processing unit 20.

The DS error encoding parameters (e.g., or dispersed storage error coding parameters for encoding and decoding) include data segmenting information (e.g., how many segments data (e.g., a file, a group of files, a data block, etc.) is divided into), segment security information (e.g., per segment encryption, compression, integrity checksum, etc.), error coding information (e.g., pillar/IDA width, decode threshold, read threshold, write threshold, etc.), slicing information (e.g., the number of encoded data slices that will be created for each data segment); and slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).

The DSTN managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSTN module 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.

The DSTN managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the DSTN managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate a per-access billing information. In another instance, the DSTN managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.

Another DS management service includes the DSTN managing unit 18 performing network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, DST execution units, and/or DST processing units) from the distributed computing system 10, and/or establishing authentication credentials for DST execution units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the system 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the system 10.

To support data storage integrity verification within the distributed computing system 10, the DST integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the DST integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSTN module 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in memory of the DSTN module 22. Note that the DST integrity processing unit 20 may be a separate unit as shown, it may be included in the DSTN module 22, it may be included in the DST processing unit 16, and/or distributed among the DST execution units 36.

Each slice name is unique to a corresponding encoded data slice and includes multiple fields associated with the overall namespace of the DSN. For example, the fields may include a pillar number/pillar index, a vault identifier, an object number uniquely associated with a particular file for storage, and a data segment identifier of a plurality of data segments, where the particular file is divided into the plurality of data segments. For example, each slice name of a set of slice names corresponding to a set of encoded data slices that has been dispersed storage error encoded from a common data segment varies only by entries of the pillar number field as each share a common vault identifier, a common object number, and a common data segment identifier.

To support distributed task processing on received data, the distributed computing system 10 has two primary operations: DST (distributed storage and/or task processing) management and DST execution on received data. With respect to the storage portion of the DST management, the DSTN managing unit 18 functions as previously described. With respect to the tasking processing of the DST management, the DSTN managing unit 18 performs distributed task processing (DTP) management services. One such DTP management service includes the DSTN managing unit 18 establishing DTP parameters (e.g., user-vault affiliation information, billing information, user-task information, etc.) for a user device 12-14 individually or as part of a group of user devices.

Another DTP management service includes the DSTN managing unit 18 performing DTP network operations, network administration (which is essentially the same as described above), and/or network maintenance (which is essentially the same as described above). Network operations include, but are not limited to, authenticating user task processing requests (e.g., valid request, valid user, etc.), authenticating results and/or partial results, establishing DTP authentication credentials for user devices, adding/deleting components (e.g., user devices, DST execution units, and/or DST processing units) from the distributed computing system, and/or establishing DTP authentication credentials for DST execution units.

To support distributed task processing on stored data, the distributed computing system 10 has two primary operations: DST (distributed storage and/or task) management and DST execution on stored data. With respect to the DST execution on stored data, if the second type of user device 14 has a task request 38 for execution by the DSTN module 22, it sends the task request 38 to the DST processing unit 16 via its interface 30. With respect to the DST management, it is substantially similar to the DST management to support distributed task processing on received data.

FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (TO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSTN interface module 76.

The DSTN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSTN interface module 76 and/or the network interface module 70 may function as the interface 30 of the user device 14 of FIG. 1. Further note that the IO device interface module 62 and/or the memory interface modules may be collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of another embodiment of a dispersed storage network (DSN) that includes the distributed storage and task (DST) processing unit 16 of FIG. 1, the network 24 of FIG. 1, and a plurality of DST execution (EX) units 1-n. The DST processing unit 16 includes the DST client module 34 of FIG. 1. Each DST execution unit includes the DST client module 34 of FIG. 1, a memory 35, and the processing module 50 of FIG. 2. Hereafter, the set of DST execution units may be referred to as a set of storage units and each DST execution unit may be interchangeably referred to as a storage unit. Each DST execution unit may be implemented utilizing the DST execution unit 36 of FIG. 1. The DSN functions to access an encoded data slice.

In various embodiments, A DST execution unit that receives a slice for storage, or at any later time (such as re-writing the slice, verifying the slice for integrity, performing a maintenance task, re-compacting one or more slices stored together, among other possibilities) may decide on a set of encoding algorithms to apply to the slice, and decide on an order in which to apply them. For example, the DST execution unit may elect to apply a reversible encoding operation that includes a compression function, an encryption function, and an integrity adding function. Each of these functions may be indicated by a unique identifier. Upon performing the encoding operation, the ordered list of encoding algorithm identifiers and the slice (encoded with those algorithms), and the original slice size is then stored. At a future point in time, when the slice is requested for reading, the DST execution unit, before returning the slice to the requester must decode the slice, operates by performing the inverse of each encode operation and in the opposite order in which they are indicated in the list. For example, first decoding verifying and removing the integrity information, decrypting the data, then decompressing it. This will result in the original content of the slice as it was received, and the DST execution unit may then return it to the requester.

The determination of which encoding/decoding algorithms (codecs) to apply may be based on the particular capabilities or configuration of the DST execution unit. For example, a DST execution unit with accelerated encryption capability may choose to encrypt, while one lacking that function may choose not to. Alternately, some algorithms are more optimized for certain computing architectures, in that case, the selection of the algorithm may be based on which is most optimized for the computing architecture used by the DST execution unit to perform the encoding. At other times, external policies, such as compliance with certain regulations may drive which algorithms are used, for example, when running in a FIPS-140-2 complaint mode, certain hash functions may be mandated over others. As the hardware or policies change, the DST execution unit is free to de-code and then re-encode its slices to utilize alternate combinations of codecs.

In an embodiment, a processing system of a dispersed storage and task (DST) execution unit comprises at least one processor and a memory that stores operational instructions, that when executed by the at least one processor causes the processing system to receive a slice access request for execution by the DST execution unit. At least one ordered codec algorithm is identified and is utilized to execute the slice access request. A slice access response indicating an outcome of the slice access request is generated by the DST execution unit.

In various embodiments of the processing system of the DST execution unit, the at least one ordered codec algorithm is identified based on at least one of: a slice name or a codec algorithm identifier associated with the slice access request. The at least one ordered codec algorithm can be identified based on at least one of: a storage unit capability, a storage set capability, a request from another storage unit, a data type, a slice size, a performance requirement, a security requirement, or system registry information.

In various embodiments of the processing system of the DST execution unit, the slice access request includes a write request to write a first data slice to a memory of the DST execution unit. The slice access request can be executed by performing the at least one ordered codec algorithm in a forward order on the first data slice to generate an encoded data slice for storage in the memory of the DST execution unit.

In various embodiments of the processing system of the DST execution unit, the slice access request includes a read request to read a second, pre-encoded data slice from a memory of the DST execution unit. The at least one ordered codec algorithm can be identified by reproducing a codec algorithm identifier associated with the second, pre-encoded data slice. The slice access request can be executed by retrieving the second, pre-encoded data slice from the memory and by performing the at least one ordered codec algorithm in a reverse order to generate a decoded data slice from the second, pre-encoded data slice. The slice access response can include the decoded data slice.

In various embodiments, a storage unit receiving, via the network 24, a slice access request (e.g., slice 1) from the DST processing unit 16 identifies one or more ordered codec algorithms based on one or more of a slice name, a codec algorithm identifier of the slice access request, a storage unit capability, a storage set capability, a request from another storage unit, a data type, a slice size, a performance requirement, a security requirement, and/or system registry information. For example, the processing module 50 of DST execution unit 1 can identify the one or more ordered codec algorithms and generate identifiers of the one or more codec algorithms as a codec selection 1 when the slice access request includes a write slice request. As another example, the processing module 50 can reproduce (e.g., regenerate) and/or look up the identifiers when the slice access request includes a read slice request

Having identified the one or more ordered codec algorithms, the DST client module 34 of the storage unit can perform the slice access request utilizing the identified one or more codec algorithms. For example, the DST client module 34 can encode the received slice 1 with the one or more codec algorithms in a forward order to produce an encoded slice 1 for storage in the in the memory 35 when processing the write slice request. As another example, the DST client module 34 can retrieve the encoded data slice 1 from the memory 35, and decode the encoded slice 1 with the identified one or more codec algorithms in a reverse order to reproduce the slice 1 when processing the read slice request.

Having performed the access request, the DST client module 34 can issue, via the network 24, a slice access response to the DST processing unit 16. For example, when processing the write slice request, the DST client module 34 of the DST execution unit 1 can send a write slice response to the DST processing unit 16, where the write slice response indicates an outcome of the write slice request. As another example, when processing the read slice requests, the DST client module 34 of the DST execution unit 1 can send the reproduced slice 1 to the DST processing unit 16.

FIG. 4 is a flowchart illustrating an example of accessing an encoded data slice. In particular, a method is presented for use in conjunction with one or more functions and features described in conjunction with FIGS. 1-3 for execution by a dispersed storage and task (DST) execution unit that includes a processor or via another processing system of a dispersed storage network that includes at least one processor and memory that stores instruction that configure the processor or processors to perform the steps described below. Step 502 includes receiving a slice access request for execution by the DST execution unit. Step 504 includes identifying at least one ordered codec algorithm. Step 506 includes executing the slice access request by utilizing the identified ordered codec algorithm. Step 508 includes generating a slice access response indicating an outcome of the slice access request.

In various embodiments, the at least one ordered codec algorithm is identified based on at least one of: a slice name or a codec algorithm identifier associated with the slice access request. The method can further include identifying at least one ordered codec algorithm based on at least one of: a storage unit capability, a storage set capability, a request from another storage unit, a data type, a slice size, a performance requirement, a security requirement, or system registry information.

In various embodiments, the slice access request includes a write request to write a first data slice to a memory. The slice access request can be executed by performing the at least one ordered codec algorithm in a forward order on the first data slice to generate an encoded data slice for storage in the memory.

In various embodiments, the slice access request includes a read request to read a second, pre-encoded data slice from a memory of the DST execution unit. The at least one ordered codec algorithm can be identified by reproducing a codec algorithm identifier associated with the second, pre-encoded data slice. The slice access request can be executed by retrieving the second, pre-encoded data slice from the memory and by performing the at least one ordered codec algorithm in a reverse order to generate a decoded data slice from the second, pre-encoded data slice. The slice access response can include the decoded data slice.

In an embodiment, a non-transitory computer readable storage medium comprises at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to receive a slice access request for execution. At least one ordered codec algorithm is identified. The slice access request is executed by utilizing the at least one ordered codec algorithm. A slice access response indicating an outcome of the slice access request is generated.

The method described above in conjunction with the computing device and the storage units can alternatively be performed by other modules of the dispersed storage network or by other devices. For example, any combination of a first module, a second module, a third module, a fourth module, etc. of the computing device and the storage units may perform the method described above. In addition, at least one memory section (e.g., a first memory section, a second memory section, a third memory section, a fourth memory section, a fifth memory section, a sixth memory section, etc. of a non-transitory computer readable storage medium) that stores operational instructions can, when executed by one or more processing modules of one or more computing devices and/or by the storage units of the dispersed storage network (DSN), cause the one or more computing devices and/or the storage units to perform any or all of the method steps described above.

As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “operable to” or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item. As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1.

As may also be used herein, the terms “processing module”, “processing circuit”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.

The present invention has been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claimed invention. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality. To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claimed invention. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.

In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.

The present invention may have also been described, at least in part, in terms of one or more embodiments. An embodiment of the present invention is used herein to illustrate the present invention, an aspect thereof, a feature thereof, a concept thereof, and/or an example thereof. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process that embodies the present invention may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.

The term “module” is used in the description of the various embodiments of the present invention. A module includes a processing module, a functional block, hardware, and/or software stored on memory for performing one or more functions as may be described herein. Note that, if the module is implemented via hardware, the hardware may operate independently and/or in conjunction software and/or firmware. As used herein, a module may contain one or more sub-modules, each of which may be one or more modules.

While particular combinations of various functions and features of the present invention have been expressly described herein, other combinations of these features and functions are likewise possible. The present invention is not limited by the particular examples disclosed herein and expressly incorporates these other combinations. 

What is claimed is:
 1. A method for execution by a storage unit that includes a processor, the method comprising: receiving a first slice access request for execution by the storage unit, wherein the first slice access request includes a write request to write a first data slice to a memory of the storage unit; identifying a first plurality of ordered codec algorithms based on a storage unit capability, a storage set capability, a request from another storage unit, a data type of the first data slice, a slice size of the first data slice, a performance requirement, a security requirement, or system registry information, wherein the first plurality of ordered codec algorithms includes a compression function, an encryption function, and an integrity adding function; executing the first slice access request by performing the first plurality of ordered codec algorithms in a forward order on the first data slice to generate a first encoded data slice and storing, in the memory of the storage unit, the first encoded data slice and at least one identifier of the first plurality of ordered codec algorithms, wherein the forward order includes the compression function, then the encryption function, and then the integrity adding function; receiving a second slice access request for execution by the storage unit, wherein the second slice access request includes a read request to read the first data slice from the memory of the storage unit; identifying the first plurality of ordered codec algorithms based on the at least one identifier of the first plurality of ordered codec algorithms associated with the first data slice; executing the second slice access request by retrieving the first encoded data slice from the memory and by performing the first plurality of ordered codec algorithms in a reverse order to generate a first decoded data slice from the first encoded data slice; and generating a first slice access response indicating an outcome of the second slice access request.
 2. The method of claim 1, wherein the first plurality of ordered codec algorithms is identified further based on a slice name associated with the first data slice.
 3. The method of claim 1, wherein the first slice access response includes the first decoded data slice.
 4. The method of claim 1, wherein the reverse order includes the integrity adding function, then the encryption function, and then the compression function.
 5. The method of claim 1, wherein the at least one identifier of the first plurality of ordered codec algorithms includes an ordered list of identifiers associated with each of the first plurality of ordered codec algorithms.
 6. The method of claim 1, further comprising: receiving a third slice access request for execution by the storage unit, wherein the third slice access request includes a write request to write a second data slice to the memory of the storage unit; identifying a second plurality of ordered codec algorithms; executing the third slice access request by performing the second plurality of ordered codec algorithms in a forward order on the second data slice to generate an second encoded data slice, and storing, in the memory of the storage unit, the second encoded data slice and at least one identifier of the second plurality of ordered codec algorithms.
 7. The method of claim 6, further comprising: receiving a fourth slice access request for execution by the storage unit, wherein the fourth slice access request includes a read request to read the second data slice from the memory of the storage unit; identifying the second plurality of ordered codec algorithms based on the at least one identifier of the second plurality of ordered codec algorithms associated with the second data slice; executing the fourth slice access request by retrieving the second encoded data slice from the memory and by performing the second plurality of ordered codec algorithms in a reverse order to generate a second decoded data slice from the second encoded data slice; generating a second slice access response indicating an outcome of the fourth slice access request.
 8. A processing system of a storage unit comprises: a memory that stores operational instructions; and processing circuitry that includes a processor configured by the operational instructions to perform operations including: receiving a first slice access request for execution by the storage unit, wherein the first slice access request includes a write request to write a first data slice to a memory of the storage unit; identifying a first plurality of ordered codec algorithms based on a storage unit capability, a storage set capability, a request from another storage unit, a data type of the first data slice, a slice size of the first data slice, a performance requirement, a security requirement, or system registry information, wherein the first plurality of ordered codec algorithms includes a compression function, an encryption function, and an integrity adding function; executing the first slice access request by performing the first plurality of ordered codec algorithms in a forward order on the first data slice to generate a first encoded data slice and storing, in the memory of the storage unit, the first encoded data slice and at least one identifier of the first plurality of ordered codec algorithms, wherein the forward order includes the compression function, then the encryption function, and then the integrity adding function; receiving a second slice access request for execution by the storage unit, wherein the second slice access request includes a read request to read the first data slice from the memory of the storage unit; identifying the first plurality of ordered codec algorithms based on the at least one identifier of the first plurality of ordered codec algorithms associated with the first data slice; executing the second slice access request by retrieving the first encoded data slice from the memory and by performing the first plurality of ordered codec algorithms in a reverse order to generate a first decoded data slice from the first encoded data slice; and generating a first slice access response indicating an outcome of the second slice access request.
 9. The processing system of claim 8, wherein the first plurality of ordered codec algorithms is identified further based on a slice name associated with the first data slice.
 10. The processing system of claim 8, wherein the first slice access response includes the first decoded data slice.
 11. The processing system of claim 8, wherein the reverse order includes the integrity adding function, then the encryption function, and then the compression function.
 12. The processing system of claim 8, wherein the at least one identifier of the first plurality of ordered codec algorithms includes an ordered list of identifiers associated with the first plurality of ordered codec algorithms.
 13. A non-transitory computer readable storage medium comprises: at least one memory section that stores operational instructions that, when executed by a processing system of a storage unit that includes a processor and a memory, causes the processing system to perform operations including: receiving a first slice access request for execution by the storage unit, wherein the first slice access request includes a write request to write a first data slice to a memory of the storage unit; identifying a first plurality of ordered codec algorithms based on a storage unit capability, a storage set capability, a request from another storage unit, a data type of the first data slice, a slice size of the first data slice, a performance requirement, a security requirement, or system registry information, wherein the first plurality of ordered codec algorithms includes a compression function, an encryption function, and an integrity adding function; executing the first slice access request by performing the first plurality of ordered codec algorithms in a forward order on the first data slice to generate a first encoded data slice and storing, in the memory of the storage unit, the first encoded data slice and at least one identifier of the first plurality of ordered codec algorithms, wherein the forward order includes the compression function, then the encryption function, and then the integrity adding function; receiving a second slice access request for execution by the storage unit, wherein the second slice access request includes a read request to read the first data slice from the memory of the storage unit; identifying the first plurality of ordered codec algorithms based on the at least one identifier of the first plurality of ordered codec algorithms associated with the first data slice; executing the second slice access request by retrieving the first encoded data slice from the memory and by performing the first plurality of ordered codec algorithms in a reverse order to generate a first decoded data slice from the first encoded data slice; and generating a first slice access response indicating an outcome of the second slice access request.
 14. A non-transitory computer readable storage medium of claim 13, wherein the at least one identifier of the first plurality of ordered codec algorithms includes an ordered list of identifiers associated with each of the first plurality of ordered codec algorithms. 